Journal article

Imprimitive symmetric graphs with cyclic blocks

CH Li, CE Praeger, S Zhou

European Journal of Combinatorics | ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD | Published : 2010

Abstract

Let Γ be a graph admitting an arc-transitive subgroup G of automorphisms that leaves invariant a vertex partition B with parts of size v ≥ 3. In this paper we study such graphs where: for B, C ∈ B connected by some edge of Γ, exactly two vertices of B lie on no edge with a vertex of C; and as C runs over all parts of B connected to B these vertex pairs (ignoring multiplicities) form a cycle. We prove that this occurs if and only if v = 3 or 4, and moreover we give three geometric or group theoretic constructions of infinite families of such graphs. © 2009 Elsevier Ltd. All rights reserved.

University of Melbourne Researchers

Grants

Awarded by Australian Research Council


Funding Acknowledgements

Research for this paper was supported by Discovery Project Grants DP0770915 and DP0558677 of the Australian Research Council. The second author was supported by Australian Research Council Federation Fellowship FF0776186.